Network Design with Selfish Agents

نویسنده

  • Lukasz Kaiser
چکیده

Think of sea transport companies or broadband internet providers each company needs to connect a few ports or users every connection has a constant cost connection is bought if all together pay for it no additional utility Network Design with Selfish Agents – p.3

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interdependent Security Game Design over Constrained Linear Influence Networks

In today's highly interconnected networks, security of the entities are often interdependent. This means security decisions of the agents are not only influenced by their own costs and constraints, but also are affected by their neighbors’ decisions. Game theory provides a rich set of tools to analyze such influence networks. In the game model, players try to maximize their utilities through se...

متن کامل

Evolving cooperation in the non-iterated prisoner's dilemma: A social network inspired approach

Online service provision is becoming increasingly decentralized as system designers pursue the benefits gained from utilizing nodes at the periphery of the network. However, distributing control means relying on the cooperation of participating agents, and it is a significant challenge to design mechanisms that incentivise optimal global behavior in a population of selfish, rational agents. Thi...

متن کامل

On Selfish Creation of Robust Networks

Robustness is one of the key properties of nowadays networks. However, robustness cannot be simply enforced by design or regulation since many important networks, most prominently the Internet, are not created and controlled by a central authority. Instead, Internet-like networks emerge from strategic decisions of many selfish agents. Interestingly, although lacking a coordinating authority, su...

متن کامل

Selfish vs. Unselfish Optimization of Network Creation

We investigate several variants of a network creation model: a group of agents builds up a network between them while trying to keep the costs of this network small. The cost function consists of two addends, namely (i) a constant amount for each edge an agent buys and (ii) the minimum number of hops it takes sending messages to other agents. Despite the simplicity of this model, various comple...

متن کامل

Expected Price of Anarchy for the Dynamic Network Formation Game Model

Recent studies revealed that some social and technological network formations can be represented by the network formation games played by selfish multiple agents. In general, the topologies formed by selfish multiple agents are worse than or equal to those formed by the centralized designer in the sense of social total welfare. Several works such as the price of anarchy are known as a measure f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010